Chomsky e a linguística cartesiana

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Towards a Coalgebraic Chomsky Hierarchy

The Chomsky hierarchy plays a prominent role in the foundations of theoretical computer science relating classes of formal languages of primary importance as well as the grammars and machine models that represent those language classes. It is well-known that regular languages can be captured by coalgebras. They form precisely the image of all finite coalgebras for the set functor X 7→ 2×X under...

متن کامل

Chomsky: A Content Language Translation Agent

This paper describes Chomsky, a content language translation agent. This agent provides a service, which first translates the content expression from its original language into an abstract logic language (ALL). Then, the resulting ALL expression is translated to the desired target language. ALL has been designed as a superset of most known content languages to avoid loosing expressiveness durin...

متن کامل

What if Chomsky were right?

The outcome of scientific research depends on how a phenomenon is viewed and how the questions are phrased. This applies also to the nativist view of language acquisition. As a complement to MacWhinney’s discussion of nativism from the viewpoint of cognitive psychology, I would like to devote this commentary to the question of the title from the viewpoint of computational linguistics. Formally,...

متن کامل

Reflection in the Chomsky Hierarchy

The class of regular languages can be generated from the regular expressions. These regular expressions, however, do not themselves form a regular language, as can be seen using the pumping lemma. On the other hand, the class of enumerable languages can be enumerated by a universal language that is one of its elements. We say that the enumerable languages are reflexive. In this paper we investi...

متن کامل

A Chomsky-Schützenberger Representation for Weighted Multiple Context-free Languages

We prove a Chomsky-Schützenberger representation theorem for weighted multiple context-free languages.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Trans/Form/Ação

سال: 2010

ISSN: 0101-3173

DOI: 10.1590/s0101-31732010000100009